Games and full abstraction for a functional metalanguage with recursive types
نویسنده
چکیده
Now welcome, the most inspiring book today from a very professional writer in the world, games and full abstraction for a functional metalanguage with recursive types. This is the book that many people in the world waiting for to publish. After the announced of this book, the book lovers are really curious to see how this book is actually. Are you one of them? That's very proper. You may not be regret now to seek for this book to read.
منابع مشابه
Games and Full Abstraction for FPC
A new category of games is developed which improves over existing such categories in that it interprets sums as well as products, function spaces and recursive types. A model of FPC, a sequential functional language with just this type structure, is described and shown to be fully abstract.
متن کاملFull Abstraction by Translation
This paper shows how a fully abstract model for a rich metalanguage like FPC can be used to prove theorems about other languages. In particular, we use results obtained from a game semantics of FPC to show that the natural translation of the lazy-calculus into the metalanguage is fully abstract, thus obtaining a new full abstraction result from an old one. The proofs involved are very easy|all ...
متن کاملGames for Recursive Types
We present results concerning the solution of recursive domain equations in the category G of games, which is a modiied version of the category presented in AJM94]. New constructions corresponding to lifting and separated sum for games are presented, and are used to generate games for two simple recursive types: the vertical and lazy natural numbers. Recently, the \game semantics" paradigm has ...
متن کاملRecursive Types in Games: Axiomatics and Process Representation
This paper presents two basic results on game-based semantics of FPC, a metalanguage with sums, products, exponentials and recursive types. First we give an axiomatic account of the category of games G introduced in [15], offering a fundamental structural analysis of the category as well as a transparent way to prove computational adequacy. As a consequence we obtain an intensional fullabstract...
متن کاملApplications of Polytypism in Theorem Proving
Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of polymorphic equality, prettyprinting, and the encoding and decoding of high-level datatypes to and from low-level binary formats. In this paper, we discuss how polytypism supports some aspects of theorem proving: automated ter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998